An Index Coding Approach to Caching With Uncoded Cache Placement
نویسندگان
چکیده
منابع مشابه
Combination Networks with Caches: Novel Inner and Outer Bounds with Uncoded Cache Placement
This paper studies the tradeoff between the memory size M and the download time / rate R for networks where a server with N files is connected to H relays (without caches), which in turns are connected to K users equipped with caches of size M files. When each user is connected to a different subset of r relays, i.e., K = ( H r ) , the system is referred to as a combination network with end-use...
متن کاملCache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching
We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases, when the user is equipped with a cache that holds an uncoded fraction r from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the user privately...
متن کاملAnnex cache: a cache assist to implement selective caching
Efficient instruction and data caches are extremely important for achieving good performance from modern high performance processors. Conventional cache architectures exploit locality, but do so rather blindly. By forcing all references through a single structure, the cache’s effectiveness on many references is reduced. This paper presents a selective caching scheme for improving cache performa...
متن کاملUncoded Placement Optimization for Coded Delivery
Existing coded caching schemes fail to simultaneously achieve efficient content placement for non-uniform file popularity and efficient content delivery in the presence of common requests, and hence may not achieve desirable average load under a non-uniform, possibly very skewed, popularity distribution. In addition, existing coded caching schemes usually require the splitting of a file into a ...
متن کاملCentralized Caching with Unequal Cache Sizes
We address centralized caching problem with unequal cache sizes. We consider a system with a server of files connected through a shared error-free link to a group of cacheenabled users where one subgroup has a larger cache size than the rest. We investigate caching schemes with uncoded cache placement which minimize the load of worst-case demands over the shared link. We propose a caching schem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2967753